Managing Simple Re-entrant Ow Lines Theoretical Foundation and Experimental Results

نویسندگان

  • Carlos F. Bispo
  • Sridhar Tayur
چکیده

We address several aspects related to managing re-entrant lines in a uni ed manner { capacity allocation, inventory management and production control. Our approach to study these systems is through simulation based optimization. Simulation o ers the exibility to model the complexities adequately while the gradient computation (via In nitesimal Perturbation Analysis) helps identify good solutions quickly. Our framework is a discrete time capacitated multiple product production-inventory system operating under a base stock policy. We analyze several di erent production and capacity allocation rules. We develop expressions for and validate the appropriate IPA derivatives. These derivatives can then be used in an optimization tool which enables the determination of optimal parameters for the several policies proposed. We also present a summary of insights obtained through an extensive computational study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Managing Simple Re-entrant Ow Lines Ii. Experimental Study

This paper continues our study on the management of multi-product, capacitated re-entrant lines. Based on the theoretical framework developed in 2], we discuss some insights obtained by a simulation study. We are interested in understanding the performance of implementable capacity management schemes (No-sharing, Partial Sharing and Total Sharing) and production rules (Linear Scaling, Equalize ...

متن کامل

Managing Simple Re-entrant Ow Lines I. Theoretical Foundation

We address several aspects related to managing re-entrant lines in an uniied manner { capacity allocation, inventory management and production control { in a set of three papers. Our approach to study these systems is through simulation based optimization. Simulation ooers the exibility to model the complexities adequately while the gradient computation (via Innnitesimal Perturbation Analysis) ...

متن کامل

A Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II

In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Modeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time

This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997